One-Pass Graphic Approximation of Integer Sequences
نویسنده
چکیده
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give a new approach for generating a graphic approximation of the sequence. This approximation scheme is fast, requiring only one pass through the sequence, and produces small probability distribution distances for large sequences.
منابع مشابه
Streaming Partitioning of Sequences and Trees
We study streaming algorithms for partitioning integer sequences and trees. In the case of trees, we suppose that the input tree is provided by a stream consisting of a depth-first-traversal of the input tree. This captures the problem of partitioning XML streams, among other problems. We show that both problems admit deterministic (1+ )-approximation streaming algorithms, where a single pass i...
متن کاملStreaming Algorithms for Partitioning Integer Sequences
We study the problem of partitioning integer sequences in the one-pass data streaming model. Given is an input stream of integers X ∈ {0, 1, . . . ,m} of length n with maximum element m, and a parameter p. The goal is to output the positions of separators splitting the input stream into p contiguous blocks such that the maximal weight of a block is minimized. We show that computing an optimal s...
متن کاملSome Problems on Graphic Sequences
A nonnegative integer sequence π is graphic if there is some simple graph G having degree sequence π. In that case, G is said to realize or be a realization of π. A given degree sequence may have many realizations, and it has been of interest to examine the spectrum of properties and parameters that occur across these realizations. In this survey, we present five areas of recent research on gra...
متن کاملRamsey-type Numbers for Degree Sequences
A (finite) sequence of nonnegative integers is graphic if it is the degree sequence of some simple graph G. Given graphs G1 and G2, we consider the smallest integer n such that for every n-term graphic sequence π, there is some graph G with degree sequence π with G1 ⊆ G or with G2 ⊆ G. When the phrase “some graph” in the prior sentence is replaced with “all graphs” the smallest such integer n i...
متن کاملDegree sequence realizations with given packing and covering of spanning trees
Designing networks in which every processor has a given number of connections often leads to graphic degree sequence realization models. A nonincreasing sequence d = (d1, d2, . . . , dn) is graphic if there is a simple graphGwith degree sequence d. The spanning tree packing number of graphG, denoted by τ(G), is themaximumnumber of edge-disjoint spanning trees in G. The arboricity of graph G, de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1712.05240 شماره
صفحات -
تاریخ انتشار 2017